Resources, concurrency, and local reasoning

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Resources, Concurrency and Local Reasoning

In this paper we show how a resource-oriented logic, separation logic, can be used to reason about the usage of resources in concurrent programs.

متن کامل

Concurrency and local reasoning under reverse exchange

Quite a number of aspects of concurrency are reflected by the inequational exchange law (P ∗Q) ; (R ∗S) ≤ (P ;R)∗(Q ;S) between sequential composition ; and concurrent composition ∗. In particular, recent research has shown that, under a certain semantic definition, validity of this law is equivalent to that of the familiar concurrency rule for Hoare triples. Unfortunately, while the law holds ...

متن کامل

Reverse Exchange for Concurrency and Local Reasoning

Recent research has pointed out the importance of the inequational exchange law (P ∗Q) ; (R∗S) ≤ (P ;R)∗ (Q ;S) for concurrent processes. In particular, it has been shown that this law is equivalent to validity of the concurrency rule for Hoare triples. Unfortunately, the law does not hold in the relationally based setting of algebraic separation logic. However, we show that under mild conditio...

متن کامل

Reasoning about Nonblocking Concurrency

Verification of concurrent algorithms has been the focus of much research over a considerable period of time, and a variety of techniques have been developed that are suited to particular classes of algorithm, for example algorithms based on message passing or mutual exclusion. The development of nonblocking or lock-free algorithms, which rely only on hardware primitives such as Compare And Swa...

متن کامل

Semantic Matchmaking of Web Resources with Local Closed-World Reasoning

Ontology languages like OWL allow for semantically rich annotation of resources, such as products advertised at an electronic online marketplace, while the Description Logic (DL) formalism underlying OWL provides reasoning techniques to perform matchmaking on such annotations. We identify peculiarities in the use of DL inferences for matchmaking which are due to the open-world semantics of OWL,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2007

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2006.12.035